EMBEDDING RESIDUE ARITHMETIC INTO MODULAR MULTIPLICATION FOR INTEGERS AND POLYNOMIALS

A brand new methodology for embedding residue arithmetic inside a dual-field Montgomery modular multiplication formula for integers in as well as for polynomials was presented within this project. A design methodology for incorporating Residue Number System (RNS) and Polynomial Residue Number System (PRNS) in Montgomery modular multiplication in GF (p) or GF (2n) correspondingly, in addition to VLSI architecture of the dual-field residue arithmetic Montgomery multiplier are presented within this paper. In cryptographic applications to engender the public and private keys we suffer from the arithmetic operations like advisement, subtraction and multiplication. An analysis of input/output conversions to/from residue representation, combined with the suggested residue Montgomery multiplication formula, reveals prevalent multiply-accumulate data pathways both between your converters and backward and forward residue representations